Majority and Positional Voting in a Probabilistic Framework

نویسنده

  • SALVADOR BARBERA
چکیده

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. Oxford University Press and The Review of Economic Studies, Ltd. are collaborating with JSTOR to digitize, preserve and extend access to The Review of Economic Studies. 1. INTRODUCTION A lot of attention has been devoted recently to the study of social decision-making procedures which combine voting with chance (for different approaches to the subject, see Zeckhauser (1969), Fishburn (1972a, b, 1978) Intriligator (1973) and Barbera and Sonnen-schein (1977).) Decision schemes are procedures of this kind which assign a lottery on the set of alternatives to each N-tuple of rankings of alternatives. It is interpreted that they specify the probability with which each of the alternatives open to society is to be chosen, on the basis of the ordinal preferences on these alternatives expressed by the members of this society. In this paper I define two wide classes of decision schemes-supporting size and point voting decision schemes-which can be viewed as natural adaptations to the probabilistic framework of two basic principles used in making deterministic choices: majority and positional voting. It is noted that these two principles, which are in general incompatible within a deterministic framework, can be jointly satisfied within the setting of decision schemes by what I call simple decision schemes, a third class which is the intersection of the two above. The theorems in the paper characterize these three classes in terms of the properties they satisfy. Some of these properties are, in turn, adaptations to the new framework of standard conditions in social choice theory: anonymity, neutrality and strategy-proofness. Two other new properties are introduced, which I call alternative independence and individual independence. The following results are obtained:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective and Optimal Fusion Rule in the Presence of Probabilistic Spectrum Sensing Data Falsification Attack

Cognitive radio (CR) network is an excellent solution to the spectrum scarcity problem. Cooperative spectrum sensing (CSS) has been widely used to precisely detect of primary user (PU) signals. The trustworthiness of the CSS is vulnerable to spectrum sensing data falsification (SSDF) attack. In an SSDF attack, some malicious users intentionally report wrong sensing results to cheat the fusion c...

متن کامل

The Core with Positional Spatial Voting

After introducing a way to analyze positional voting outcomes in a spatial voting context, ‘core’ type theorems are proved for these voting rules, and their runoffs, in the single issue setting. While spatial voting has proved to be a valuable way to interject geometry and geometric intuition into the analysis of voting rules, the current methodology is essentially limited to pairwise compariso...

متن کامل

Approval voting and positional voting methods: Inference, relationship, examples

Approval voting is the voting method recently adopted by the Society for Social Choice and Welfare. Positional voting methods include the famous plurality, antiplurality, and Borda methods. We extend the inference framework of Tsetlin and Regenwetter (2003) from majority rule to approval voting and all positional voting methods. We also establish a link between approval voting and positional vo...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010